A two-phase algorithm for solving a class of hard satisfiability problemsWARNERS, J. P; VAN MAAREN, H.Operations research letters. 1998, Vol 23, Num 3-5, pp 81-88, issn 0167-6377Article

PROBABILISTIC ANALYSIS OF THE DAVIS PUTNAM PROCEDURE FOR SOLVING THE SATISFIABILITY PROBLEMFRANCO J; PAULL M.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 77-87; BIBL. 4 REF.Conference Paper

On the probabilistic performance of algorithms for the satisfiability problemFRANCO, J.Information processing letters. 1986, Vol 23, Num 2, pp 103-106, issn 0020-0190Article

AN APPRAISAL OF COMPUTATIONAL COMPLEXITY FOR OPERATIONS RESEARCHERS = UNE EVALUATION DE LA COMPLEXICITE DE CALCUL POUR LES CHERCHEURS DE RECHERCHE OPERATIONNELLELENSTRA JK; RINNOOY KAN AHG; VAN EMDE BOAS P et al.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 3; PP. 201-210; BIBL. 64 REF.Article